Orchestrating parallel TCP connections: Cyclic and probabilistic polling policies

Orchestrating parallel TCP connections: Cyclic and probabilistic polling policies

The standard Transmission Control Protocol (TCP) is based on an additive rate increase in absence of congestion, and on multiplicative decrease triggered by congestion signals. However, it does not scale well as the distances, or as the speed of the network, increase. Thus, we study some of the solutions that have been proposed to encounter this problem. These solutions include (i) splitting th...

On optimal polling policies

In a single server polling system, the server visits the queues according to a routing policy and while at a queue serves some or all of the customers there according to a service policy. A polling (or scheduling) policy is a sequence of decisions on whether to serve a customer, idle the server, or switch the server to another queue. The goal of this paper is to nd polling policies that stochas...

Cyclic Bernoulli Polling I

We introduce, analyse and optimize the class of Bernoulli random polling systems. The server moves cyclically among N channels (queues), but Change-over times between stations are composed of walking times required to 'move' from one channel to another and switch-in times that are incurred only when the server actually enters a station to render service. The server uses a Bernoulli random mecha...

Cyclic Bernoulli polling

Steady State and Transient Behavior Analyses of TCP Connections considering Interactions between TCP connections and Network

The Internet uses a window-based flow control mechanism in TCP (Transmission Control Protocol). In the literature, there have been a significant number of analytical studies on TCP. Most of those studies, however, have focused on the statistical behavior of TCP by assuming a constant packet loss probability in the network. In our previous work, we have presented an approach for modeling the net...